Arithmetic complexity via effective names for random sequences
نویسندگان
چکیده
منابع مشابه
Effective Generation of Subjectively Random Binary Sequences
We present an algorithm for effectively generating binary sequences which would be rated by people as highly likely to have been generated by a random process, such as flipping a fair coin.
متن کاملComplexity regularization via localized random penalties
In this joint work with Gabor Lugosi (Pompeu Fabra University), model selection via penalized empirical loss minimization in nonparametric classification problems is studied. Data-dependent penalties are constructed, which are based on estimates of the complexity of a small subclass of each model class, containing only those functions which have small empirical loss. The penalties are novel sin...
متن کاملEffective symbolic dynamics, random points, statistical behavior, complexity and entropy
We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction we prove that such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodi...
متن کاملAuthentication via Localized Names
We address the problem of message authentication using the -calculus, which has been given an operational semantics in [2] that provides each sequential process of a system with its own local space of names. We exploit here that semantics and its localized names to guarantee by construction that a message has been generated by a given entity. Therefore, our proposal can be seen as a reference f...
متن کاملAn Uncertainty Principle for Arithmetic Sequences
Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are “well-distributed” in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to equi-distribution, as have Fourier analysts when working with the “uncertainty principle”. In this article we find that these ideas have a natural setting in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2012
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2287718.2287724